Randomness is Hard
نویسندگان
چکیده
We study the set of incompressible strings for various resource bounded versions of Kolmogorov complexity. The resource bounded versions of Kolmogorov complexity we study are: polynomial time CD complexity deened by Sipser, the nondeterministic variant due to Buhrman and Fortnow, and the polynomial space bounded Kolmogorov complexity, CS introduced by Hartmanis. For all of these measures we deene the set of random strings R CD t , R CND t , and R CS s as the set of strings x such that CD t (x), CND t (x), and CS s (x) is greater than or equal to the length of x, for s and t polynomials. We show the following: MA NP R CD t , where MA is the class of Merlin-Arthur games deened by Babai. These results show that the set of random strings for various resource bounds is hard for complexity classes under nondeterministic reductions. This paper contrasts the earlier work of Buhrman and Mayordomo where they show that for polynomial time deterministic reductions the set of exponential time Kolmogorov random strings is not complete.
منابع مشابه
A Randomness Test for Stable Data
In this paper, we propose a new method for checking randomness of non-Gaussian stable data based on a characterization result. This method is more sensitive with respect to non-random data compared to the well-known non-parametric randomness tests.
متن کاملA remark on pseudo proof systems and hard instances of SAT∗
We link two concepts from the literature, namely hard sequences for the satisfiability problem sat and so-called pseudo proof systems proposed for study by Kraj́ıček. Pseudo proof systems are elements of a particular nonstandard model constructed by forcing with random variables. We show that the existence of mad pseudo proof systems is equivalent to the existence of a randomized polynomial time...
متن کاملClique is hard to approximate within n
We prove that, unless any problem in NP can be solved in probabilistic polynomial time, for any ǫ > 0, the size of the largest clique in a graph with n nodes is hard to approximate in polynomial time within a factor n. This is done by constructing, for any δ > 0, a probabilistically checkable proof for NP which uses logarithmic randomness and δ amortized free bits.
متن کاملUnique k-SAT is as Hard as k-SAT
In this work we show that Unique k-SAT is as hard as k-SAT for every k ∈ N. This settles a conjecture by Calabro, Impagliazzo, Kabanets and Paturi [4]. To provide an affirmative answer to this conjecture, we develop a randomness optimal construction of Isolation Lemma for k-SAT.
متن کاملThe Complexity of Hardness Amplification and Derandomization
This thesis studies the interplay between randomness and computation. We investigate this interplay from the perspectives of hardness amplification and derandomization. Hardness amplification is the task of taking a function that is hard to compute on some input or on some fraction of inputs, and producing a new function that is very hard on average, i.e. hard to compute on a fraction of inputs...
متن کاملWhy are People Bad at Detecting Randomness? Because it is Hard
People often detect structure and patterns in data that is random. This difficulty in accurately evaluating randomness manifests itself in mistaken beliefs that a fair coin has a bias towards heads or tails, detection of causal relationships between variables that randomly co-occur, or observation of illusory correlations between continuous variables. A computational analysis of an optimal reas...
متن کامل